Zoning Multidimensional Access Methods for Analytical Database Applications
نویسندگان
چکیده
In emerging analytical database applications that deal with large sets of multidimensional static data sets, the performance of the query system significantly depends on the performance of its access methods and the underlying disk system. In recent years, hard disks are manufactured with multiple physical zones, where seek times and data transfer rates vary significantly across the zones. However, there is a marked lack of investigation on how to optimize multidimensional access methods given a zoned disk model. Instead, conventional access methods have been developed based on a traditional disk model that comes with many simplifying assumptions such as an average seek-time and a single data transfer rate. The paper proposes a novel optimization technique that can be applied to a variety of multidimensional access method and that can fully utilize zoning characteristics of hard disks. In the proposed approaches, index structures are zoned in such a way that more frequently accessed index pages are stored in a faster disk zone. Then our localized query processing techniques significantly improve the query performance by reducing page retrieval times from the hard disk.
منابع مشابه
An Efficient Zoning Technique for Multi-dimensional Access Methods
In emerging database applications that deal with large sets of multidimensional data, the performance of the query system significantly depends on the performance of its access methods and the underlying disk system. In recent years, hard disks are manufactured with multiple physical zones, where seek times and data transfer rates vary significantly across the zones. However, there is a marked ...
متن کاملIntegrating the UB-Tree into a Database System Kernel
Multidimensional access methods have shown high potential for significant performance improvements in various application domains. However, only few approaches have made their way into commercial products. In commercial database management systems (DBMSs) the BTree is still the prevalent indexing technique. Integrating new indexing methods into existing database kernels is in general a very com...
متن کاملMultidimensional or Relational? / How to Organize an On-line Analytical Processing Database
In the past few years, the number of On-line Analytical Processing (OLAP) applications increased quickly. These applications use two significantly different database structures: multidimensional and table-based. One can show that the traditional model of relational databases cannot make difference between these two structures. Another model is necessary to make the most important differences vi...
متن کاملHow to Organize an On-line Analytical Processing Database
In the past few years, the number of On-line Analytical Processing (OLAP) applications increased quickly. These applications use two significantly different database structures: multidimensional and table-based. One can show that the traditional model of relational databases cannot make difference between these two structures. Another model is necessary to make the most important differences vi...
متن کاملIndexing Techniques in Data Warehousing Environment The UB-Tree Algorithm
The indexing techniques in multidimensional databases are becoming more and more important. The data warehouse environment has become a popular technology and a lot of research work has been done in order to improve the query performance and to provide faster response times. The ability to answer these queries e fficiently is a critical issue since most of them are complex and iterative. In thi...
متن کامل